MIDA: A Multi Item-type Double-Auction Mechanism

نویسندگان

  • Erel Segal-Halevi
  • Avinatan Hassidim
  • Yonatan Aumann
چکیده

In a seminal paper, McAfee (1992) presented a truthful mechanism for double auction, attaining asymptotically-optimal gain-from-trade without any prior information on the valuations of the traders. McAfee’s mechanism handles single-parametric agents, allowing each seller to sell a single item and each buyer to buy a single item. In this paper, we present a double-auction mechanism that handles multiparametric agents and allow multiple items per trader. Each seller is endowed with several units of a pre-specified type and has diminishing marginal returns. Each buyer may buy multiple types and has a gross-substitute valuation function. Both buyers and sellers are quasi-linear in money. The mechanism is prior-free, ex-post individually-rational, dominant-strategy truthful and strongly budget-balanced. Its gain-from-trade approaches the optimum when the market in all item-types is sufficiently large. ∗This research was funded in part by the ISF grant 1083/13, the Doctoral Fellowships of Excellence Program and the Mordecai and Monique Katz Graduate Fellowship Program at Bar-Ilan University. We are grateful to Ron Adin, Simcha Haber, Ron Peretz, Assaf Romm, Tom van der Zanden, the participants of the game-theory seminar in Bar-Ilan University and the economic theory seminar in the Hebrew university of Jerusalem for their helpful comments. †[email protected], corresponding author. ar X iv :1 60 4. 06 21 0v 4 [ cs .G T ] 1 5 Ja n 20 17

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms

Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...

متن کامل

Auctions with Buyer Preferences

Auctions and exchanges are one of the most important market mechanisms for price determination and allocation of goods. In this paper we consider the case when each buyer has a limited budget and wishes to buy at most one item in multi-item auctions. We show the limitations of two known mechanisms { sequence of single-item auctions and recently introduced XOR double auctions { and introduce a n...

متن کامل

Selecting Efficient Service-providers in Electric Power Distribution Industry Using Combinatorial Reverse Auction

In this paper, a combinatorial reverse auction mechanism is proposed for selecting the most efficient service-providers for resolving sustained power interruptions in multiple regions of an electric power distribution company’s responsibility area. Through this mechanism, supplying the required service in each region is assigned to only one potential service-provider considering two criteria in...

متن کامل

A Sealed-Bid Unit-Demand Auction with Put Options∗

We introduce a variant of the classic sealed-bid unit-demand auction in which each item has an associated put option. The put option of an item is held by the seller of the item, and gives the holder the right to sell the item to a specified target bidder at a specified strike price, regardless of market conditions. Unexercised put options expire when the auction terminates. In keeping with the...

متن کامل

Secure Multi-attribute Procurement Auction

In this paper, we develop a secure multi-attribute procurement auction, in which a sales item is defined by several attributes called qualities, the buyer is the auctioneer (e.g., a government), and the sellers are the bidders. We first present a Vickrey-type protocol that can be used for multi-attribute procurement auctions. Next, we show how this protocol can be executed securely. key words :...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016